Towards Random Sampling with Contact Constraints
نویسندگان
چکیده
Random sampling strategies play critical roles in ran-domized motion planners, which are promising and practical for motion planning problems with many degrees of freedom (dofs). In this paper, we explore random sampling in a constrained connguration space { the contact connguration space between two polyhedra, motivated by the need for generating contact motion plans. Given a contact formation (CF) between two polyhedra A and B, our approach is to randomly generate conngurations of A satisfying the contact constraints of the CF. Key to the approach is to guarantee that sampling happens only in the constrained space to be eecient, which has not been addressed in the literature. We have implemented a strategy for random sampling of conngurations constrained by CFs consisting of a single principal contact (PC) with good results. We plan to further extend the approach to CFs with multiple PCs, and apply the results to contact motion planning.
منابع مشابه
On Random Sampling in Contact Con guration Space
Random sampling strategies play critical roles in randomized motion planners, which are promising and practical for motion planning problems with many degrees of freedom (dofs). In this paper, we address random sampling in a constrained con guration space { the contact con guration space between two polyhedra, motivated by the need for generating contact motion plans. Given a contact formation ...
متن کاملRandom sampling remap for compressible two-phase flows
In this paper we address the problem of solving accurately gas-liquid compressible flows without pressure oscillations at the gas-liquid interface. We introduce a new Lagrange-projection scheme based on a random sampling technique introduced by Chalons and Goatin in [CG07]. We compare it to a ghost fluid approach introduced in [WLK06, MBKKH09] which is based on the ghost fluid method for the po...
متن کاملTHE EFFECTS OF INITIAL SAMPLING AND PENALTY FUNCTIONS IN OPTIMAL DESIGN OF TRUSSES USING METAHEURISTIC ALGORITHMS
Although Genetic algorithm (GA), Ant colony (AC) and Particle swarm optimization algorithm (PSO) have already been extended to various types of engineering problems, the effects of initial sampling beside constraints in the efficiency of algorithms, is still an interesting field. In this paper we show that, initial sampling with a special series of constraints play an important role in the conv...
متن کاملRandom Sampling with Removal
Random sampling is a classical tool in constrained optimization. Under favorable conditions, the optimal solution subject to a small subset of randomly chosen constraints violates only a small subset of the remaining constraints. Here we study the following variant that we call random sampling with removal: suppose that after sampling the subset, we remove a fixed number of constraints from the...
متن کاملPlanning Motions Compliant to Complex Contact States
Many robotic tasks require compliant motions, but planning such motions pose special challenges not present in collision-free motion planning. One challenge is how to achieve exactness, i.e., how to make sure that a planned path is exactly compliant to a desired contact state, especially when the con guration manifold of such a contact state is hard to describe analytically due to high geometri...
متن کامل